Computational Origami of a Morley's Triangle
نویسندگان
چکیده
We present a computational origami construction of Morley’s triangles and automated proof of correctness of the generalized Morley’s theorem in a streamlined process of solving-computing-proving. The whole process is realized by a computational origami system being developed by us. During the computational origami construction, geometric constraints in symbolic and numeric representation are generated and accumulated. Those constraints are then transformed into algebraic relations, which in turn are used to prove the correctness of the construction. The automated proof required non-trivial amount of computer resources, and shows the necessity of networked services of mathematical software. This example is considered to be a case study for innovative mathematical knowledge management.
منابع مشابه
Morley's Trisector Theorem
Morley's trisector theorem states that " The points of intersection of the adjacent trisectors of the angles of any triangle are the vertices of an equilateral triangle " [10]. The notation and terminology used in this paper have been introduced in the
متن کاملComputational Construction of a Maximum Equilateral Triangle Inscribed in an Origami
We present an origami construction of a maximum equilateral triangle inscribed in an origami, and an automated proof of the correctness of the construction. The construction and the correctness proof are achieved by a computational origami system called Eos (E-origami system). In the construction we apply the techniques of geometrical constraint solving, and in the automated proof we apply Gröb...
متن کاملHovers Systems Simulation Using the Origami Science and Testing It's Mechanical Resistance
Purpose: The main concern of this research is a fundamental study in ruling elements of Hovers bone system and making relationship between Bionic and Cybernetic sciences in order to make a better understanding of different sciences and effective use of biologic models and systems for industrial designs. Materials and Methods: the research was done with Origami science, using paper as a basic m...
متن کاملNP-Hard Triangle Packing Problems
In computational geometry, packing problems ask whether a set of rigid pieces can be placed inside a target region such that no two pieces overlap. The triangle packing problem is a packing problem that involves triangular pieces, and it is crucial for algorithm design in many areas, including origami design, cutting industries, and warehousing. Previous works in packing algorithms have conject...
متن کاملComputational Origami Construction as Constraint Solving and Rewriting
Computational origami is the computer assisted study of origami geometry. An origami is constructed by a finite sequence of fold steps, each consisting in folding along a fold line or unfolding. We base the fold methods on a formal system called Huzita’s axiom system, and show how folding an origami can be formulated by a conditional rewrite system. A rewriting sequence of origami structures is...
متن کامل